Sign-balances of Tableaux with at Most Three Rows
نویسندگان
چکیده
Let the sign of a standard Young tableau (SYT) be permutation obtained by reading entries row from left to right, starting top row. By sign-reversing involution on tableaux in terms lattice paths, we obtain sign-balance $n$-cell SYTs all shapes with at most three rows. For skew shapes, partial results enumeration $2n$-cell rows, under parity condition part.
منابع مشابه
Chromaticity of Turan Graphs with At Most Three Edges Deleted
Let $P(G,lambda)$ be the chromatic polynomial of a graph $G$. A graph $G$ ischromatically unique if for any graph $H$, $P(H, lambda) = P(G,lambda)$ implies $H$ is isomorphic to $G$. In this paper, we determine the chromaticity of all Tur'{a}n graphs with at most three edges deleted. As a by product, we found many families of chromatically unique graphs and chromatic equivalence classes of graph...
متن کاملGraphs with Branchwidth at Most Three
In this paper we investigate both the structure of graphs with branchwidth at most three, as well as algorithms to recognise such graphs. We show that a graph has branchwidth at most three, if and only if it has treewidth at most three and does not contain the three-dimensional binary cube graph as a minor. A set of four graphs is shown to be the obstruction set of graphs with branchwidth at mo...
متن کاملWeyl Groupoids with at Most Three Objects
We adapt the generalization of root systems of the second author and H. Yamane to the terminology of category theory. We introduce Cartan schemes, associated root systems and Weyl groupoids. After some preliminary general results, we completely classify all finite Weyl groupoids with at most three objects. The classification yields that there exist infinitely many “standard”, but only 9 “except...
متن کاملThree-manifolds with Heegaard genus at most two represented by crystallisations with at most 42 vertices
It is known that every closed compact orientable 3-manifold M can be represented by a 4-edge-coloured 4-valent graph called a crystallisation of M. Casali and Grasselli proved that 3-manifolds of Heegaard genus g can be represented by crystallisations with a very simple structure which can be described by a 2(g +1)-tuple of non-negative integers. The sum of first g +1 integers is called complex...
متن کاملRegular Projections of Graphs with at Most Three Double Points
We investigate some relations between a generic immersion of a graph into the 2-space with small number of double points and the embeddings of the graph into the 3-space obtained by lifting the immersion with respect to the natural projection from the 3-space to the 2-space. Specifically we prove: (1) An embedding of a graph obtained from a generic immersion of the graph with at most three doub...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2021
ISSN: ['1027-5487', '2224-6851']
DOI: https://doi.org/10.11650/tjm/210305